Walks on Borders of Polygons
نویسندگان
چکیده
We give a graph theoretical proof for the existence of a walk connecting left and right sides of a rectangle when it is partitioned into (finitely many) rectangles colored in a specific way, and the walk is aloud to use only borders between rectangles of different color. The problem was originally introduced by J.R. Isbell in the proof of his Zig-Zag Theorem. We prove the existence of such a walk also when the problem is generalized other partitions of the rectangle, such as partitions to arbitrary polygons.
منابع مشابه
Prudent walks and polygons
We have produced extended series for two-dimensional prudent polygons, based on a transfer matrix algorithm of complexity O(n), for a series of length n. We have extended the definition to three dimensions and produced series expansions for both prudent walks and polygons in three dimensions. For prudent polygons in two dimensions we find the growth constant to be smaller than that for the corr...
متن کاملHoneycomb lattice polygons and walks as a test of series analysis techniques
We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution for polygons. Analysis of the series yields accurate estimates for the connective constant, critical exponents and amplitudes of honeycomb self-avoiding walks...
متن کاملThe linking number and the writhe of uniform random walks and polygons in confined spaces
Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the ...
متن کاملCurvature of random walks and random polygons in confinement
The purpose of this paper is to study the curvature of equilateral random walks and polygons that are confined in a sphere. Curvature is one of several basic geometric properties that can be used to describe random walks and polygons. We show that confinement affects curvature quite strongly, and in the limit case where the confinement diameter equals the edge length the unconfined expected cur...
متن کاملThe enumeration of prudent polygons by area and its unusual asymptotics
Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and k-sided prudent walks (with k = 1, 2, 3, 4) are, in essence, only allowed to grow along k directions. Prudent polygons are prudent walks that return to a point adjacent to their starting point. Prudent walks and polygons have been previously enumerated by length and perimeter (Bousquet-Mél...
متن کامل